List Edge and List Total Colorings of Planar Graphs without 6-cycles with Chord
نویسندگان
چکیده
Giving a planar graph G, let χl(G) and χ ′′ l (G) denote the list edge chromatic number and list total chromatic number of G respectively. It is proved that if a planar graph G without 6-cycles with chord, then χl(G) ≤ ∆(G) + 1 and χ ′′ l (G) ≤ ∆(G) + 2 where ∆(G) ≥ 6.
منابع مشابه
Edge colorings of planar graphs without 5-cycles with two chords
It is proved here that if a planar graph has maximum degree at least 6 and any 6-cycle contains at most one chord, then it is of class 1.
متن کاملEdge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Let G be a planar graph with no two 3-cycles sharing an edge. We show that if ∆(G) ≥ 9, then χ′l(G) = ∆(G) and χ ′′ l (G) = ∆(G) + 1. We also show that if ∆(G) ≥ 6, then χ ′ l(G) ≤ ∆(G) + 1 and if ∆(G) ≥ 7, then χ′′ l (G) ≤ ∆(G) + 2. All of these results extend to graphs in the projective plane and when ∆(G) ≥ 7 the results also extend to graphs in the torus and Klein bottle. This second edge-c...
متن کاملGroup edge choosability of planar graphs without adjacent short cycles
In this paper, we aim to introduce the group version of edge coloring and list edge coloring, and prove that all 2-degenerate graphs along with some planar graphs without adjacent short cycles is group (∆(G) + 1)-edgechoosable while some planar graphs with large girth and maximum degree is group ∆(G)-edge-choosable.
متن کاملSome Results on List Total Colorings of Planar Graphs
Let G be a planar graph with maximum degree Δ. In this paper, it is proved that if Δ ≥ 9, then G is total-(Δ+2)-choosable. Some results on list total coloring of G without cycles of specific lengths are given.
متن کاملChoosability and edge choosability of planar graphs without five cycles
It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)h c oosable. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Choosability, Edge choosability, Degeneracy, Planar graph.
متن کامل